Full Restart Speeds Learning
نویسندگان
چکیده
Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solver's success depends greatly upon the heuristics chosen to guide the process; some heuristics perform well on one class of problems, but are less successful on another. ACE is a constraint solver that learns to customize a mixture of heuristics to solve a class of problems. The work described here accelerates that learning by setting higher performance standards. ACE now recognizes when its current learning attempt is not promising, abandons the responsible training problems, and restarts the entire learning process. This paper describes how such full restart (of the learning process rather than of an individual problem) demands careful evaluation if it is to provide effective learning and robust testing performance.
منابع مشابه
Optimal restart times for moments of completion time - Software, IEE Proceedings- [see also Software Engineering, IEE Proceedings]
Restart is an application-level technique that speeds up jobs with highly variable completion times. The authors present an efficient iterative algorithm to determine the restart strategy that minimises higher moments of completion time, when the total number of restarts is finite. They demonstrate its computational efficiency in comparison with alternative algorithms. They also discuss fast ap...
متن کاملReusing the Assignment Trail in CDCL Solvers
We present the solver RestartSATwhich includes a novel technique to reduce the cost to perform a restart in CDCL SAT solvers. This technique, called ReusedTrail, exploits the observation that CDCL solvers often reassign the same variables to the same truth values after a restart. It computes a partial restart level for which it is guaranteed that all variables below this level will be reassigne...
متن کاملRestart Strategy Selection Using Machine Learning Techniques
Restart strategies are an important factor in the performance of conflict-driven Davis Putnam style SAT solvers. Selecting a good restart strategy for a problem instance can enhance the performance of a solver. Inspired by recent success applying machine learning techniques to predict the runtime of SAT solvers, we present a method which uses machine learning to boost solver performance through...
متن کاملOptimal restart times for moments of completion time
Restart is an application-level technique that speeds up completion for jobs with highly variable completion times. In this paper, we present an efficient iterative algorithm to determine the optimal restart strategy if there are a finite number of restarts, and if one is interested in minimising higher moments of the completion time. We demonstrate its computational efficiency in comparison wi...
متن کاملEvaluating CDCL Restart Schemes
Modern CDCL (conflict-driven clause learning) SAT solvers are used for many practical applications. One of the key ingredients of state-of-the-art CDCL solvers are efficient restart schemes. The main contribution of this work is an extensive empirical evaluation of various restart strategies. We show that optimal static restart intervals are not only correlated with the satisfiability status of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006